Test configuration optimization method based on NSGA2-MOPSO algorithm
نویسندگان
چکیده
منابع مشابه
A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts
In extending the Particle Swarm Optimisation methodology to multi-objective problems it is unclear how global guides for particles should be selected. Previous work has relied on metric information in objective space, although this is at variance with the notion of dominance which is used to assess the quality of solutions. Here we propose methods based exclusively on dominance for selecting gu...
متن کاملConfiguration Design Optimization Method
This work presents a method (CDOM) for optimizing multiple system level assembly characteristics of complex mechanical assemblies by placement of their components. It addresses any component shape (including non-convex, hollow, sharp edges) connected together by functional constraints. This method finds multiple solutions to the Engineering Configuration Design Problem (ECDP) and proposes a sim...
متن کاملTest Pattern Generator Design Optimization Based on Genetic Algorithm
In this paper an approach for the generation of deterministic test pattern generator logic composed of D-type and T-type flip-flops is described. The approach employs a genetic algorithm to find an acceptable practical solution in a large space of possible implementations. In contrast to conventional approaches our genetic algorithm approach reduces the gate count of built-in self-test structur...
متن کاملCONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD
Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...
متن کاملSequential Model-Based Optimization for General Algorithm Configuration
State-of-the-art algorithms for hard computational problems often expose many parameters that can be modified to improve empirical performance. However, manually exploring the resulting combinatorial space of parameter settings is tedious and tends to lead to unsatisfactory outcomes. Recently, automated approaches for solving this algorithm configuration problem have led to substantial improvem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1754/1/012186